DELFT UNIVERSITY OF TECHNOLOGY REPORT 13-11 Evaluation of Multilevel Sequentially Semiseparable Preconditioners on CFD Benchmark Problems Using IFISS
نویسندگان
چکیده
This paper studies a new preconditioning technique for sparse systems arising from discretized partial differential equations (PDEs) in computational fluid dynamics (CFD), which exploit the multilevel sequentially semiseparable (MSSS) structure of the system matrix. MSSS matrix computations give a data-sparse way to approximate the LU factorization of a sparse matrix from discretized PDEs in linear computational complexity with respect to the problem size. In contrast to the standard block preconditioners, we exploit the global MSSS structure of the 2 by 2 block system from the discretized Stokes equation and linearized Navier-Stokes equation. This avoids the approximation of the Schur complement, which is a big advantage over standard block preconditioners. Numerical experiments on standard CFD benchmark problems in IFISS were carried out to evaluate the performance of the MSSS preconditioners. It was illustrated that the MSSS preconditioner yields mesh size independence convergence. Moreover, the convergence is almost insensitive to the viscosity parameter. Comparison with the algebraic multigrid (AMG) method and the geometric multigrid (GMG) method, the MSSS preconditioning technique is more robust than both the AMG method and the GMG method, and considerably faster than the AMG method.
منابع مشابه
A Class of Efficient Preconditioners with Multilevel Sequentially Semiseparable Matrix Structure
This paper presents a class of preconditioners for sparse systems arising from discretized partial differential equations (PDEs). In this class of preconditioners, we exploit the multilevel sequentially semiseparable (MSSS) structure of the system matrix. The off-diagonal blocks of MSSS matrices are of low-rank, which enables fast computations of linear complexity. In order to keep the low-rank...
متن کاملDELFT UNIVERSITY OF TECHNOLOGY REPORT 08-05 Theoretical Comparison of Two-Level Preconditioners based on Multigrid and Deflation
It is well-known that two-level preconditioned conjugate gradient (PCG) methods provide efficient techniques for solving large and sparse linear systems whose coefficient matrices are symmetric and positive definite (SPD). A two-level PCG method combines traditional and projectiontype preconditioners to get rid of the effect of both small and large eigenvalues of the coefficient matrix. In the ...
متن کاملDELFT UNIVERSITY OF TECHNOLOGY REPORT 02-12 Some Numerical Aspects for Solving Sparse Large Linear Systems Derived from the Helmholtz Equation
In this report, several numerical aspects and difficulties for solving a linear system derived from the time-harmonic wave equations are overviewed. The presentation begins with the derivation of the governing equation for waves propagating in general inhomogeneous media. Due to the need of numerical solutions, various discretizations based on finite difference are discussed. Some numerical met...
متن کاملDELFT UNIVERSITY OF TECHNOLOGY REPORT 08-09 SIMPLE-type preconditioners for the Oseen problem
In this report, we discuss block preconditioners used to solve the incompressible Navier-Stokes equations. We emphasize on the approximation of the Schur complement used in SIMPLE-type preconditioners. In the usual formulation, the Schur complement uses scaling with the diagonal of the convection diffusion matrix. A variant of SIMPLE, SIMPLER is studied. Convergence of the SIMPLER preconditione...
متن کاملEvolutionary Optimization of Least-Squares Support Vector Machines
The performance of Kernel Machines depends to a large extent on its kernel function and hyperparameters. Selecting these is traditionally done using intuition or a costly “trial-and-error” approach, which typically prevents these methods from being used to their fullest extent. Therefore, two automated approaches are presented for the selection of a suitable kernel function and optimal hyperpar...
متن کامل